Reversibility of extreme relational structures
نویسندگان
چکیده
منابع مشابه
Categories of relational structures
The paper characterises compositional homomorphims of relational structures. A detailed study of three categories of such structures { viewed as multialgebras { reveals the one with the most desirable properties. In addition, we study analogous categories with homomorphisms mapping elements to sets (thus being relations). Finally, we indicate some consequences of our results for partial algebra...
متن کاملComplexities of relational structures
The relational complexity, introduced by G. Cherlin, G. Martin, and D. Saracino, is a measure of ultrahomogeneity of a relational structure. It provides an information on minimal arity of additional invariant relations needed to turn given structure into an ultrahomogeneous one. The original motivation was group theory. This work focuses more on structures and provides an alternative approach. ...
متن کاملContextual equivalences in configuration structures and reversibility
Contextual equivalence equate terms that have the same observable behaviour in any context. A standard contextual equivalence for CCS is the strong barbed congruence. Configuration structures are a denotational semantics for processes in which one define equivalences that are more discriminating, i.e. that distinguish the denotation of terms equated by barbed congruence. Hereditary history pres...
متن کاملExtreme relational orientation - 1 Running Head: EXTREME RELATIONAL ORIENTATION Giving Away Too Much: Extreme Relational Orientation and Self-sacrifice at the Bargaining Table
The authors identify an individual difference dimension that is an important predictor of distributive bargaining behavior. In three studies the “unmitigated communion” scale (Fritz & Helgeson, 1998) is used to measure extreme relational orientation, the degree to which individuals have a self-sacrificing concern for others. Results from three studies support convergent and discriminant constru...
متن کاملRippling on Relational Structures
The rippling heuristic has been rather successfully used to guide inductive proofs in a functional framework. We present here how that heuristic can be formalized in a relational framework, more adapted to logic programming. The rippling heuristic is rst analysed to identify its key components. A formalization of these to a relational framework is then presented. The applicability and the power...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2019
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-019-00703-9